Tenacity and some related results

author

Dara Moazzami University of Tehran, College of Engineering, Department of Engineerng Science

Abstract:

Conceptually graph vulnerability relates to the study of graphintactness when some of its elements are removed. The motivation forstudying vulnerability measures is derived from design and analysisof networks under hostile environment. Graph tenacity has been anactive area of research since the the concept was introduced in1992. The tenacity T(G) of a graph G is defined asbegin{center} $T(G)=displaystyle min_{Asubset V(G)}{frac{mid Amid +tau(G-A)}{omega(G-A)}}$end{center}where $tau(G-A)$ denotes the order (the number of vertices) of alargest component of G-A and $omega(G-A)$ is the number ofcomponents of G-A. In this paper we discuss tenacity and its properties invulnerability calculation.

Upgrade to premium to download articles

Already have an account?login

similar resources

Some Results on Tenacity of Graphs∗

The tenacity of an incomplete connected graph G is defined as T (G) = min{ |S|+m(G−S) ω(G−S) : S ⊂ V (G), ω(G− S) > 1}, where ω(G− S) and m(G− S), respectively, denote the number of components and the order of a largest component inG−S. This is a reasonable parameter to measure the vulnerability of networks, as it takes into account both the amount of work done to damage the network and how bad...

full text

Some New Characterization Results on Exponential and Related Distributions

full text

global results on some nonlinear partial differential equations for direct and inverse problems

در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}

Journal title

Journal of Algorithms and Computation

volume 49 issue 1

pages 83- 91

publication date 2017-06-01

unfollow

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

vertex connectivity toughness binding number independence number edge-connectivity

Hosted on Doprax cloud platform doprax.com